About triangles in a graph and its complement
نویسندگان
چکیده
منابع مشابه
Packing triangles in a graph and its complement
How few edge-disjoint triangles can there be in a graph G on n vertices and in its complement G? This question was posed by P. Erdó́s, who noticed that if G is a disjoint union of two complete graphs of order n=2 then this number is n=12 þ o(n). Erdó́s conjectured that any other graph with n vertices together with its complement should also contain at least that many edge-disjoint triangles. In t...
متن کاملOn the Connectivity of a Graph and its Complement Graph
In this paper, we study the connectivity of the complement of a graph. We first establish a simple formula to compute the connectivity of a graph that comes from the join of graphs. Base on this formula, we give an upper and a lower bound to the connectivity of the complement of a graph. Keyword: connectivity, complement, join, vertex of attachment.
متن کاملgraphs cospectral with a friendship graph or its complement
let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...
متن کاملDisjoint triangles and pentagons in a graph
Let n, s, and t be integers with s ≥ 1, t ≥ 0, and n = 3s + 5t. Let G be a graph of order n such that the minimum degree of G is at least (n + s + t)/2. Then G contains s + t independent subgraphs such that s of them are triangles and t of them are pentagons.
متن کاملPaired-domination number of a graph and its complement
A paired-dominating set of a graph G = (V, E) with no isolated vertex is a dominating set of vertices inducing a graph with a perfect matching. The paired-domination number of G, denoted by γpr (G), is the minimum cardinality of a paired-dominating set of G. We consider graphs of order n ≥ 6, minimum degree δ such that G and G do not have an isolated vertex and we prove that – if γpr (G) > 4 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90385-9